On Probabilistic CCP
نویسندگان
چکیده
This paper investigates a probabilistic version of the concurrent constraint programming paradigm (CCP). The aim is to introduce the possibility to formulate so called \randomised algorithms" within the CCP framework. Our approach incorporates randomness directly within the (operational) semantics instead of referring to an \external" function or procedure call. We deene the operational semantics of probabilistic concurrent constraint programming (PCCP) by means of a probabilistic transition system such that the execution of a PCCP program may be seen as a stochastic process, i.e. as a random walk on the transition graph. The transition probabilities are given explicitly.
منابع مشابه
Probabilistic Choice Operators as Global Constraints: Application to Statistical Software Testing
Probabilistic Concurrent Constraint Programming (PCCP) [3] is an extension of Concurrent Constraint Programming (CCP) [5] where probabilistic choice operators are introduced to represent the randomness or uncertain behaviour of processes. A probabilistic choice between two processes can be though of as flipping a coin : head the first process is triggered, tail it is the second. Based on this t...
متن کاملAmbiguous Probabilistic Programs
Probabilistic programs are widely used decision models. When implemented in practice, however, there often exists distributional ambiguity in these models. In this paper, we model the ambiguity using the likelihood ratio (LR) and use LR to construct various ambiguity sets. We consider ambiguous probabilistic programs which optimize under the worst case. Ambiguous probabilistic programs can be c...
متن کاملA Distributed and Probabilistic Concurrent Constraint Programming Language
We present a version of the CCP paradigm, which is both distributed and probabilistic. We consider networks with a fixed number of nodes, each of them possessing a local and independent constraint store. While locally the computations evolve asynchronously, following the usual rules of (probabilistic) CCP, the communications among different nodes are synchronous. There are channels, and through...
متن کاملA Markov Model for Probabilistic Concurrent Constraint Programming
This paper introduces a new approach towards the semantics of Concurrent Constraint Programming (CCP), which is based on operator algebras. In particular , we show how stochastic matrices can be used for modelling both a quantitative version of nondeterminism (in the form of a probabilistic choice) and synchronisa-tion. We will assume Probabilistic Concurrent Constraint Programming (PCCP) as th...
متن کاملAn Operational Semantics for Probabilistic ConcurrentConstraint
This paper investigates a probabilistic version of the concurrent constraint programming paradigm (CCP). The aim is to introduce the possibility to formulate so called \randomised algorithms" within the CCP framework. Diierently from common approaches in (imperative) high-level programming languages, which rely on some kind of random() function, we introduce randomness in the very deenition of ...
متن کامل